Geometry of the Stable Ruled Surface Over an Elliptic Curve
نویسندگان
چکیده
منابع مشابه
Period Determinant of an Irregular Connection over an Elliptic Curve
In this article, we calculate the period of an irregular singular connection ∇ = d+dy on the legendre curve U : y = x(x−1)(x−λ). We calculate its de Rham cohomology and the cycles in the homology of the dual connection and describe the period matrix. Terasoma’s work is introduced to approximate the direct image connection π∗(∇) by a sequence of regular connections as an intermediate step where ...
متن کاملAn FPGA Implementation of an Elliptic Curve Processor over
This paper describes a hardware implementation of an arithmetic processor which is efficient for elliptic curve (EC) cryptosystems, which are becoming increasingly popular as an alternative for public key cryptosystems based on factoring. The modular multiplication is implemented using a Montgomery modular multiplication in a systolic array architecture, which has the advantage that the clock f...
متن کاملOn Higher Syzygies of Ruled Varieties over a Curve
For a vector bundle E of rank n + 1 over a smooth projective curve C of genus g, let X = PC(E) with projection map π : X → C. In this paper we investigate the minimal free resolution of homogeneous coordinate rings of X . We first clarify the relations between higher syzygies of very ample line bundles on X and higher syzygies of Veronese embedding of fibres of π by the same line bundle. More p...
متن کاملOn Syzygies of Ruled Varieties over a Curve
In this article we concern higher syzygies of line bundles on X = PC(E) where E is a vector bundle of rank n+1 over a smooth projective curve C of genus g. Let H be the tautological line bundle of X and projection π : X → C. Our main result is that for a = 1 or n = 1 or n = 2 and a = 2 (i.e. scrolls of arbitrary dimension or ruled surfaces or quadric surface fibrations), aH+π∗B satisfies Proper...
متن کاملEfficient elliptic curve cryptosystems
Elliptic curve cryptosystems (ECC) are new generations of public key cryptosystems that have a smaller key size for the same level of security. The exponentiation on elliptic curve is the most important operation in ECC, so when the ECC is put into practice, the major problem is how to enhance the speed of the exponentiation. It is thus of great interest to develop algorithms for exponentiation...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Bulletin of the Brazilian Mathematical Society, New Series
سال: 2020
ISSN: 1678-7544,1678-7714
DOI: 10.1007/s00574-020-00224-7